Boolean Routing on Cayley Networks
نویسندگان
چکیده
We study Boolean routing on Cayley networks. Let K (M G) denote the Kolmogorov complexity of the multiplication table of a group G of order n. We show that O(maxfd logn; K (M G)g) memory bits per local router (hence a total of O(n maxfd logn; K (M G)g) memory bits) are suucient to do Boolean routing on the Cayley network constructed from the group G and a set of d generators. It is a consequence of the classiication theorem for nite simple groups that K (M G) 2 O(log 3 n).
منابع مشابه
Computer Science Technical Report A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant de...
متن کاملCayley graph connected cycles: A new class of fixed-degree interconnection networks
We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles , which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertexsymmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in ...
متن کاملProcessor Interconnection Networks from Cayley Graphs
This paper is divided into three sections. In the first section we discuss Cayley graphs and show how they may be used as a tool for the design and analysis of network architectures for parallel computers. In the second section we present our research on the routing problem. This research can be regarded as a first attempt to find general purpose routing algorithms for interconnection networks....
متن کاملTopology-Based Routing for Xmesh in Wireless Sensor Networks
Large wireless sensor networks can contain hundreds or thousands of sensor nodes. Due to wireless sensor network’s properties of low-energy-efficiency, large-scale, low cost, and lossy nature, the development of efficient routing protocols for these large and dense wireless sensor networks is an interesting research topic. This research focuses on the design and implementation of protocols for ...
متن کاملPermutation routing via Cayley graphs with an example for bus interconnection networks
Cayley graphs have been used extensively to design interconnection networks and provide a natural setting for studying point-to-point routing [1, 2, 3, 5, 6, 7, 12]. The extension of these techniques to the more important problem of permutation routing on interconnection networks presents fundamental problems. This is due to the potentially explosive growth in both the size of the graph and the...
متن کامل